Erdös-Ko-Rado-type results over Jq(n, d), Hq(n, d) and their designs
نویسنده
چکیده
In terms of the notion of a specific class of ranked semilattices, called regular quantum matroids, we prove the Erdiis-Kc-Rado-type results in a unified way for the association schemes J,(n,d) of vector spaces and H,(n,d) of bilinear forms, together with their Delsarte t-designs, respectively. @ 1999 Elsevier Science B.V. All rights reserved
منابع مشابه
Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets
We prove Erdős-Ko-Rado and Hilton-Milner type theorems for t-intersecting k-chains in posets using the kernel method. These results are common generalizations of the original EKR and HM theorems, and our earlier results for intersecting k-chains in the Boolean algebra. For intersecting k-chains in the c-truncated Boolean algebra we also prove an exact EKR theorem (for all n) using the shift met...
متن کاملErdös-Ko-Rado theorem with conditions on the maximal degree
A family 9 of distinct k-element subsets of the n-element set X is called intersecting if Fn F’ # @ holds for all F, F’ E 9. Erdos, Ko, and Rado proved that for n > 2k necessarily ) 9 ) < (1: :) holds, which is clearly best possible (take all k-sets through a fixed element). For a family 9, its maximum degree d(9) is the maximum number of sets in .P= containing any particular element of X. For ...
متن کاملErdös-Ko-Rado-Type Theorems for Colored Sets
An Erdős-Ko-Rado-type theorem was established by Bollobás and Leader for q-signed sets and by Ku and Leader for partial permutations. In this paper, we establish an LYM-type inequality for partial permutations, and prove Ku and Leader’s conjecture on maximal k-uniform intersecting families of partial permutations. Similar results on general colored sets are presented.
متن کامل2 RRR 16 - 2009 1 On the size of a minimum transversal
Let n, d, and k be positive integers such that k ≥ 2, d ≥ 1, and n = kd. Furthermore, let N = {1, . . . , n} be the ground set and B(n, d) = {S ⊆ N : |S| = d} denote the family of all subsets of cardinality d in N ; obviously, |B(n, d)| = ( n d ) . A subfamily P (n, d) ⊆ B(n, d) that consists of k pairwise disjoint subsets is called a partition. Obviously, all sets of B(n, d) participate the sa...
متن کاملErdös-Ko-Rado theorems for chordal and bipartite graphs
One of the more recent generalizations of the Erdös-Ko-Rado theorem, formulated by Holroyd, Spencer and Talbot [10], de nes the Erdös-Ko-Rado property for graphs in the following manner: for a graph G, vertex v ∈ G and some integer r ≥ 1, denote the family of independent r-sets of V (G) by J (r)(G) and the subfamily {A ∈ J (r)(G) : v ∈ A} by J (r) v (G), called a star. Then, G is said to be r-E...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 196 شماره
صفحات -
تاریخ انتشار 1999